Applying Soundness Standards to Qualified Reasoning
نویسندگان
چکیده
منابع مشابه
Reasoning and intuiting the standards for judgments
What is the extension to which the act of reasoning and the standards of judgments are interrelated? The author, proposing Muslim scholars` views in the field and relying on traditions, ahadith, has concluded that firstly one has to answer the question: does the standard and expediency of Divine judgment lies in the judgment or in its object? The latter is signified, however, with view to so...
متن کاملDynamic Reasoning with Qualified Syllogisms
A gualij%e~ syllogism is a classical Aristoteiean syllogism that has been “qualified” through the use of fuzzy quantifiers, likelihood modifiers, and usuality modifiers, e.g., “Most birds can Ry; Tweety is a bird; therefore, it is likely that Tweety can fly.” This paper introduces a formal logic Q of such syllogisms and shows how this may be employed in a system of nonmonotonj~ reasoning. In pr...
متن کاملApplying Reasoning to Instance Transformation
Significant effort has been invested by the Semantic Web community in methodologies and tools for creating ontology mappings. Various techniques for mapping creation have been developed; however less interest has been shown in the actual usage of the created mappings and their application in concrete mediation scenarios. In this paper we show how mappings can be converted to logical rules and e...
متن کاملSound reasoning about unchecked exceptions: soundness proof
In this note we formalize a multithreaded Java-like programming language with unchecked exceptions, try-catch blocks, and synchronized blocks, as well as method contracts, object invariants, block invariants, thread-local objects, and parallel execution statements. We further formalize our verification condition generation-based modular static verification approach that verifies that the progra...
متن کاملSoundness Preserving Approximation for TBox Reasoning
Large scale ontology applications require efficient and robust description logic (DL) reasoning services. Expressive DLs usually have very high worst case complexity while tractable DLs are restricted in terms of expressive power. This brings a new challenge: can users use expressive DLs to build their ontologies and still enjoy the efficient services as in tractable languages. In this paper, w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Informal Logic
سال: 2004
ISSN: 0824-2577,0824-2577
DOI: 10.22329/il.v24i1.2131